NULL SETS AND COMBINATORIAL COVERING PROPERTIES
نویسندگان
چکیده
A subset of the Cantor cube is null-additive if its algebraic sum with any null set null. We construct a cardinality continuum such that: all continuous images into are null-additive, it contains homeomorphic copy that not and has property $\gamma$, strong combinatorial covering property. also nontrivial $\gamma$ additive. Set-theoretic assumptions used in our constructions far milder than earlier by Galvin--Miller Bartoszy\'nski--Rec{\l}aw, to obtain sets analogous properties. consider products Sierpi\'nski context
منابع مشابه
Some Topological Properties of Ω-covering Sets
We prove the following theorems: 1. There exists an ω-covering with the property s0. 2. Under cov(N ) = 2 there exists X such that ∀B∈Bor[B ∩ X is not an ω-covering or X \B is not an ω-covering]. 3. Also we characterize the property of being an ω-covering.
متن کاملCombinatorial Properties of Systems of Sets
A family of sets {A k } is called a strong d system if the intersection of any two of its members is the same, i .e ., if A kI n a = A ka n A ka . It is called a weak d system if I A k= rn A k . 1 is the same for any two sets of our family . J systems have recently been studied in several papers . f (n, r) is the smallest integer for which any family of f (n, r) sets A k , I < k < f (n, r) of s...
متن کاملCombinatorial Optimization: Packing and Covering
1 Preface The integer programming models known as set packing and set covering have a wide range of applications, such as pattern recognition, plant location and airline crew scheduling. Sometimes, due to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integer, thus solving the problem. Sometimes, both the linear progr...
متن کاملSome Topological Properties of Covering Based Rough Sets
Covering based rough sets [3,15,16,17,18,19] have been introduced as an extension of the basic rough sets introduced by Pawlak [6]. There is only one way to define the lower approximation of a set using covering. However, as many as four definitions have been proposed for the upper approximation. Accordingly, four types of covering based rough sets have been defined. In this paper we introduced...
متن کاملCovering Numbers in Covering-Based Rough Sets
Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms. This paper proposes the concepts of the lower and upper covering numbers to establish measurements in covering-b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2021
ISSN: ['1943-5886', '0022-4812']
DOI: https://doi.org/10.1017/jsl.2021.51